TSTP Solution File: QUA002^1 by Zipperpin---2.1.9999

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Zipperpin---2.1.9999
% Problem  : QUA002^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : NO INFORMATION
% Format   : NO INFORMATION
% Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.h8cIBUxAe2 true

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:32:22 EDT 2023

% Result   : Theorem 0.17s 0.67s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   23 (  15 unt;   6 typ;   0 def)
%            Number of atoms       :   62 (  43 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :   63 (   5   ~;  15   |;   0   &;  40   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   17 (  17   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   4 con; 0-3 aty)
%                                         (   3  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :   42 (  36   ^;   6   !;   0   ?;  42   :)

% Comments : 
%------------------------------------------------------------------------------
thf(union_type,type,
    union: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(singleton_type,type,
    singleton: $i > $i > $o ).

thf(addition_type,type,
    addition: $i > $i > $i ).

thf('#sk2_type',type,
    '#sk2': $i ).

thf(sup_type,type,
    sup: ( $i > $o ) > $i ).

thf('#sk1_type',type,
    '#sk1': $i ).

thf(addition_def,axiom,
    ( addition
    = ( ^ [X: $i,Y: $i] : ( sup @ ( union @ ( singleton @ X ) @ ( singleton @ Y ) ) ) ) ) ).

thf(singleton_def,axiom,
    ( singleton
    = ( ^ [X: $i,U: $i] : ( U = X ) ) ) ).

thf('0',plain,
    ( singleton
    = ( ^ [X: $i,U: $i] : ( U = X ) ) ),
    inference(simplify_rw_rule,[status(thm)],[singleton_def]) ).

thf('1',plain,
    ( singleton
    = ( ^ [V_1: $i,V_2: $i] : ( V_2 = V_1 ) ) ),
    define([status(thm)]) ).

thf(union_def,axiom,
    ( union
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ) ).

thf('2',plain,
    ( union
    = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
          ( ( X @ U )
          | ( Y @ U ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[union_def]) ).

thf('3',plain,
    ( union
    = ( ^ [V_1: $i > $o,V_2: $i > $o,V_3: $i] :
          ( ( V_1 @ V_3 )
          | ( V_2 @ V_3 ) ) ) ),
    define([status(thm)]) ).

thf('4',plain,
    ( addition
    = ( ^ [X: $i,Y: $i] : ( sup @ ( union @ ( singleton @ X ) @ ( singleton @ Y ) ) ) ) ),
    inference(simplify_rw_rule,[status(thm)],[addition_def,'1','3']) ).

thf('5',plain,
    ( addition
    = ( ^ [V_1: $i,V_2: $i] : ( sup @ ( union @ ( singleton @ V_1 ) @ ( singleton @ V_2 ) ) ) ) ),
    define([status(thm)]) ).

thf(addition_comm,conjecture,
    ! [X1: $i,X2: $i] :
      ( ( addition @ X1 @ X2 )
      = ( addition @ X2 @ X1 ) ) ).

thf(zf_stmt_0,conjecture,
    ! [X4: $i,X6: $i] :
      ( ( sup
        @ ^ [V_1: $i] :
            ( ( V_1 = X6 )
            | ( V_1 = X4 ) ) )
      = ( sup
        @ ^ [V_2: $i] :
            ( ( V_2 = X4 )
            | ( V_2 = X6 ) ) ) ) ).

thf(zf_stmt_1,negated_conjecture,
    ~ ! [X4: $i,X6: $i] :
        ( ( sup
          @ ^ [V_1: $i] :
              ( ( V_1 = X6 )
              | ( V_1 = X4 ) ) )
        = ( sup
          @ ^ [V_2: $i] :
              ( ( V_2 = X4 )
              | ( V_2 = X6 ) ) ) ),
    inference('cnf.neg',[status(esa)],[zf_stmt_0]) ).

thf(zip_derived_cl7,plain,
    ~ ( !!
      @ ^ [Y0: $i] :
          ( !!
          @ ^ [Y1: $i] :
              ( ( sup
                @ ^ [Y2: $i] :
                    ( ( Y2 = Y1 )
                    | ( Y2 = Y0 ) ) )
              = ( sup
                @ ^ [Y2: $i] :
                    ( ( Y2 = Y0 )
                    | ( Y2 = Y1 ) ) ) ) ) ),
    inference(cnf,[status(esa)],[zf_stmt_1]) ).

thf(zip_derived_cl10,plain,
    ~ ( !!
      @ ^ [Y0: $i] :
          ( ( sup
            @ ^ [Y1: $i] :
                ( ( Y1 = Y0 )
                | ( Y1 = '#sk1' ) ) )
          = ( sup
            @ ^ [Y1: $i] :
                ( ( Y1 = '#sk1' )
                | ( Y1 = Y0 ) ) ) ) ),
    inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl7]) ).

thf(zip_derived_cl11,plain,
    ( ( sup
      @ ^ [Y0: $i] :
          ( ( Y0 = '#sk2' )
          | ( Y0 = '#sk1' ) ) )
   != ( sup
      @ ^ [Y0: $i] :
          ( ( Y0 = '#sk1' )
          | ( Y0 = '#sk2' ) ) ) ),
    inference(lazy_cnf_exists,[status(thm)],[zip_derived_cl10]) ).

thf(zip_derived_cl12,plain,
    ( ( sup
      @ ^ [Y0: $i] :
          ( ( Y0 = '#sk2' )
          | ( Y0 = '#sk1' ) ) )
   != ( sup
      @ ^ [Y0: $i] :
          ( ( Y0 = '#sk1' )
          | ( Y0 = '#sk2' ) ) ) ),
    inference('simplify nested equalities',[status(thm)],[zip_derived_cl11]) ).

thf(zip_derived_cl13,plain,
    $false,
    inference(eq_res,[status(thm)],[zip_derived_cl12]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : QUA002^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.11  % Command  : python3 /export/starexec/sandbox/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox/tmp/tmp.h8cIBUxAe2 true
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Sat Aug 26 16:43:29 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 0.11/0.31  % Running portfolio for 300 s
% 0.11/0.31  % File         : /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.31  % Number of cores: 8
% 0.16/0.31  % Python version: Python 3.6.8
% 0.16/0.31  % Running in HO mode
% 0.17/0.56  % Total configuration time : 828
% 0.17/0.56  % Estimated wc time : 1656
% 0.17/0.56  % Estimated cpu time (8 cpus) : 207.0
% 0.17/0.60  % /export/starexec/sandbox/solver/bin/lams/40_c.s.sh running for 80s
% 0.17/0.60  % /export/starexec/sandbox/solver/bin/lams/35_full_unif4.sh running for 80s
% 0.17/0.60  % /export/starexec/sandbox/solver/bin/lams/40_c_ic.sh running for 80s
% 0.17/0.63  % /export/starexec/sandbox/solver/bin/lams/15_e_short1.sh running for 30s
% 0.17/0.65  % /export/starexec/sandbox/solver/bin/lams/40_noforms.sh running for 90s
% 0.17/0.66  % /export/starexec/sandbox/solver/bin/lams/40_b.comb.sh running for 70s
% 0.17/0.67  % /export/starexec/sandbox/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 0.17/0.67  % Solved by lams/15_e_short1.sh.
% 0.17/0.67  % done 0 iterations in 0.012s
% 0.17/0.67  % SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
% 0.17/0.67  % SZS output start Refutation
% See solution above
% 0.17/0.67  
% 0.17/0.67  
% 0.17/0.67  % Terminating...
% 1.55/0.76  % Runner terminated.
% 1.55/0.76  % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------